Matrix Completion With Deterministic Pattern: A Geometric Perspective
نویسندگان
چکیده
منابع مشابه
Matrix completion with deterministic pattern - a geometric perspective
We consider the matrix completion problem with a deterministic pattern of observed entries and aim to find conditions such that there will be (at least locally) unique solution to the non-convex Minimum Rank Matrix Completion (MRMC) formulation. We answer the question from a somewhat different point of view and to give a geometric perspective. We give a sufficient and “almost necessary” conditi...
متن کاملConvolutional Geometric Matrix Completion
Geometric matrix completion (GMC) has been proposed for recommendation by integrating the relationship (link) graphs among users/items into matrix completion (MC) . Traditional GMC methods typically adopt graph regularization to impose smoothness priors for MC. Recently, geometric deep learning on graphs (GDLG) is proposed to solve the GMC problem, showing better performance than existing GMC m...
متن کاملDeterministic algorithms for matrix completion
The goal of the matrix completion problem is to retrieve an unknown real matrix from a small subset of its entries. This problem comes up in many application areas, and has received a great deal of attention in the context of the Net ix challenge. This setup usually represents our partial knowledge of some information domain. Unknown entries may be due to the unavailability of some relevant exp...
متن کاملDeterministic Symmetric Positive Semidefinite Matrix Completion
We consider the problem of recovering a symmetric, positive semidefinite (SPSD) matrix from a subset of its entries, possibly corrupted by noise. In contrast to previous matrix recovery work, we drop the assumption of a random sampling of entries in favor of a deterministic sampling of principal submatrices of the matrix. We develop a set of sufficient conditions for the recovery of a SPSD matr...
متن کاملGeometric Matrix Completion with Recurrent Multi-Graph Neural Networks
Matrix completion models are among the most common formulations of recommender systems. Recent works have showed a boost of performance of these techniques when introducing the pairwise relationships between users/items in the form of graphs. Such techniques do not fully exploit the local stationary structures of user/item graphs, and the number of parameters to learn is linear w.r.t. the numbe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2019
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2018.2885494